Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings
نویسندگان
چکیده
The token ring topology is required in token passing approach used in distributed operating systems. Fault tolerance is also required in the designs of distributed systems. Note that 1-fault-tolerant design for token rings is equivalent to design of 1-Hamiltonian graphs. This paper introduces a new family of graphs called Christmas tree, denoted by CT(s). The graph CT(s) is a 3-regular, planar, 1-Hamiltonian, and Hamiltonian-connected graph. The number of nodes in CT(s) is 3 ·2s −2. Its diameter is 1 if s = 1, 3 if s = 2, and 2s if s > 3. 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Optimal k-Fault-Tolerant Networks for Token Rings
Fault-tolerant multiprocessors are widely used in on-line transaction processing. Fault tolerance is also desirable in massively parallel systems that have a relatively high failure probability. Two types of failures in a multiprocessor system are of interest, processor failures and link failures. Most of the previous research in designing optimal fault-tolerant topologies was concentrated on t...
متن کاملA Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in w...
متن کاملFault-tolerant Reconnguration of Trees and Rings in Distributed Systems
We design two programs that maintain the nodes of any distributed system in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any nite number of fail-stop failures and repairs of system nodes and communication channels. Our programs are fully distributed, have optimal time and space complexity, and illustrate two diierent methods for the design of nonmasking ...
متن کاملOptimal, Nonmasking Fault-Tolerant Recon guration of Trees and Rings
We design two programs that maintain the processes of an arbitrary distributed system in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of fail-stop failures and repairs of both processes and communication channels. Our programs are notable as they (i) are fully distributed, (ii) have optimal time complexity, and (iii) demonstrate two di erent approaches to d...
متن کاملFault Tolerant Design for Token Rings
!" interconnection network parallel computer processor ! " graph #$%& '() nodes *+,processors &./0(edges)1+,2 3 4 5 communication links 67&“ !" ” graph 3“ 2 ”(network)89 :;&<=> ?@ AB 2 computer networks CD topology E&F-GHIJ>K+LM&N OPQRSTUIJ VW optimal B &XY Z [\] ^_`abcIJ* de#B f g 2 hijkle Hamiltonian properties mB 2 CD EVnoIJ pq& rst uvw token passing xyz{|}~ distributed operating system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 72 شماره
صفحات -
تاریخ انتشار 1999